An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

We address the four-machine flowshop scheduling problem with objective of minimizing makespan uncertain processing times The was addressed in literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for problem. proposed is compared best by using extensive computational experiments. Computational experiments indicate that performs much better than terms error while both have same time. Specifically, reduces existing over 40%. This result has been confirmed tests hypotheses significance level 0.01.